Curry–Howard correspondence - PDFSEARCH.IO - Document Search Engine

Curry–Howard correspondence
Results: 226

#	Item
121	Chapter 3 Sequent Calculus In this chapter we develop the sequent calculus as a formal system for proof search in natural deduction. The sequent calculus was originally introduced by Gentzen [Gen35], primarily as a tech Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2004-01-22 08:01:14 Deduction Natural deduction Curry–Howard correspondence Sequent calculus Entailment Judgment Monotonicity of entailment Soundness Implicational propositional calculus Logic Proof theory Mathematical logic
122	Existence Results for Singular Boundary Value Problem of Nonlinear Fractional Differential Equation Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-28 22:06:37 Fractional calculus Distribution Differential equations Heat equation Curry–Howard correspondence Mathematical analysis Calculus Mathematics
123	Conditionals and Actuality* (forthcoming in Erkenntnis) Timothy Williamson University of Oxford Add to Reading List Source URL: www.philosophy.ox.ac.uk Language: English - Date: 2008-10-01 05:55:25 Ordinal numbers Constructible universe Tautology Modus ponens Curry–Howard correspondence Ordinal arithmetic Logic Mathematical logic Mathematics
124	Innovations in Computational Type Theory using Nuprl S. F. Allen, M. Bickford, R. L. Constable, R. Eaton, C. Kreitz, L. Lorigo, E. Moran Department of Computer Science, Cornell-University, Ithaca, NY[removed] {sfa,mark Add to Reading List Source URL: www.nuprl.org Language: English - Date: 2005-06-21 10:54:34 Type theory Logic in computer science Dependently typed programming Computability theory Intuitionistic type theory Curry–Howard correspondence Natural deduction Lambda calculus Combinatory logic Mathematics Logic Mathematical logic
125	A Substructural Type System for Delimited Continuations? Oleg Kiselyov1 and Chung-chieh Shan2 1 2 Add to Reading List Source URL: okmij.org Language: English - Date: 2007-04-21 02:44:20 Type theory Lambda calculus Proof theory Data types Logic in computer science Simply typed lambda calculus Type system Natural deduction Curry–Howard correspondence Software engineering Theoretical computer science Computing
126	A Tutorial on the Curry-Howard Correspondence Darryl McAdams April 9, 2013 Abstract Typical introductions to the Curry-Howard Correspondence employ Add to Reading List Source URL: www.purelytheoretical.com Language: English - Date: 2013-08-26 10:29:00 Proof theory Propositional calculus Deduction Boolean algebra Natural deduction Curry–Howard correspondence Negation Rule of inference Existential quantification Logic Mathematical logic Mathematics
127	95 Homotopy type theory ´ Alvaro Pelayo1 , Michael A. Warren2 Add to Reading List Source URL: smf4.emath.fr Language: English - Date: 2014-10-17 09:03:44 Abstract algebra Homotopy type theory Homotopy Groupoid Function Fundamental group Model category Curry–Howard correspondence Type theory Mathematics Homotopy theory Topology
128	Proofs are Programs: 19th Century Logic and 21st Century Computing Philip Wadler Avaya Labs June 2000, updated November 2000 As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were d Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-02-27 11:22:42 Lambda calculus Proof theory Logic in computer science Type theory Dependently typed programming Combinatory logic Natural deduction Curry–Howard correspondence Calculus of constructions Mathematical logic Mathematics Theoretical computer science
129	Belief Revision Revisited Ewa Madali´nska-Bugaj1 and Witold Łukaszewicz2 1 Institute of Informatics, Warsaw University, Warsaw, Poland Dept. of Computer Science, Link¨oping University, Sweden and Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-01 08:50:36 Artificial intelligence Ordinal numbers Science Mathematics Completeness Curry–Howard correspondence Knowledge representation Constructible universe Belief revision
130	Modal logics for communicating rule-based agents Natasha Alechina and Mark Jago and Brian Logan1 Abstract. In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for mul Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2006-08-16 14:42:18 Symbol Epistemic modal logic Modal logic Proof theory Lambda calculus Curry–Howard correspondence Logic Mathematical logic Mathematics

UPDATE